Plasma planarization for sensor applications
نویسندگان
چکیده
منابع مشابه
Distributed Planarization and Local Routing Strategies in Sensor Networks
We present an algorithm which computes a planar 2-spanner from an Unit Disk Graph when the node density is sufficient. The communication complexity in terms of number of node’s identifier sent by the algorithm is 6n, while the computational complexity is O(n∆), with ∆ the maximum degree of the communication graph. Furthermore, we present a simple and efficient routing algorithm dedicated to the...
متن کاملGraph Planarization
A graph is said to be planar if it can be drawn on the plane in such a way that no two of its edges cross. Given a graph G = (V,E) with vertex set V and edge set E, the objective of graph planarization is to find a minimum cardinality subset of edges F ⊆ E such that the graph G = (V,E \ F ), resulting from the removal of the edges in F from G, is planar. This problem is also known as the maximu...
متن کاملShort Paper: Structural Network Properties for Local Planarization of Wireless Sensor Networks
Network graphs satisfying redundancy and coexistence can be planarized by means of local algorithms without making assumptions on the nodes’ communication ranges. We generalize these properties to k-weak and k-strong coexistence and redundancy. Subsequently, we give empirical evidence that these properties are present in simulated wireless sensor networks as well as in actual testbed deployment...
متن کاملA GRASP for graph planarization
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. In this paper, we describe a GRASP for the graph planarization problem, extending the heuristic of Goldschmidt and Takvorian [Networks, v. 24, pp. 69–73, 1994]. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for graph planarization is...
متن کاملGenetic Algorithms for Planarization Problems
− Two near-optimum planarization algorithms are presented. The algorithms belong to a general class of algorithms known as genetic algorithms because the search procedures on which they are based are inspired on the mechanics of natural selection and natural genetics. The first algorithm is intended to generate a near-maximal planar subgraph from a given graph and also provides the routing info...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Microelectromechanical Systems
سال: 1995
ISSN: 1057-7157
DOI: 10.1109/84.465122